例句與造句

1. A cryptosystem may be semantically secure against chosen plaintext attacks or even non-adaptive chosen ciphertext attacks ( CCA1 ) while still being malleable.
2. EPOC was developed in 1999 by T . Okamoto, S . Uchiyama and E . Fujisaki of semantically secure against a chosen ciphertext attack.
3. Early versions of the PKCS # 1 standard ( up to version 1.5 ) used a construction that appears to make RSA semantically secure.
4. It can be shown that each of the three additional modes specified by the NIST are semantically secure under so-called chosen-plaintext attacks.
5. It is well known that certain types of encryption algorithm cannot satisfy definitions such as semantic security : for example, deterministic encryption algorithms can never be semantically secure.
6. It's difficult to find semantically secure in a sentence. 用semantically secure造句挺難的
7. Semantically secure encryption algorithms include RSA, can be made semantically secure ( under stronger assumptions ) through the use of random encryption padding schemes such as Optimal Asymmetric Encryption Padding ( OAEP ).
8. Semantically secure encryption algorithms include RSA, can be made semantically secure ( under stronger assumptions ) through the use of random encryption padding schemes such as Optimal Asymmetric Encryption Padding ( OAEP ).
9. Hard-core predicates of trapdoor one-way permutations ( known as "'trapdoor predicates "') can be used to construct semantically secure public-key encryption schemes.
10. Any cryptosystem that is semantically secure and is plaintext-aware is actually secure against a chosen-ciphertext attack, since any adversary that chooses ciphertexts would already know the plaintexts associated with them.
11. For an asymmetric key encryption algorithm cryptosystem to be semantically secure, it must be infeasible for a computationally bounded adversary to derive significant information about a message ( plaintext ) when given only its ciphertext and the corresponding public encryption key.
12. Unlike other security definitions, semantic security does not consider the case of chosen ciphertext attack ( CCA ), where an attacker is able to request the decryption of chosen ciphertexts, and many semantically secure encryption schemes are demonstrably insecure against chosen ciphertext attack.
13. The underlying cryptosystem is IND-CPA ( and thus semantically secure under chosen plaintext attack ) if the adversary cannot determine which of the two messages was chosen by the oracle, with probability significantly greater than 1 / 2 ( the success rate of random guessing ).
14. A better example of a perfectly binding commitment scheme is one where the commitment is the encryption of " x " under a semantically secure, public-key encryption scheme with perfect completeness, and the decommitment is the string of random bits used to encrypt " x ".
15. Because the adversary possesses the public encryption key in the above game, a semantically secure encryption scheme must by definition be probabilistic, possessing a component of randomness; if this were not the case, the adversary could simply compute the deterministic encryption of m _ 0 and m _ 1 and compare these encryptions with the returned ciphertext c to successfully guess the oracle's choice.